Abstract Control Structures And The Semantics Of Quantifiers
نویسنده
چکیده
CONTROL STRUCTURES AND THE SEMANTICS OF QUANTIFIERS Steven Cushing Computer ~ Science Department : " St. Anselm College Manchester, New Hampshire, 03102 USA
منابع مشابه
Quantifiers as Terms and Lattice-Based Semantics
When a first-order logic (FOL) is used to represent the semantics of natural language, natural language quantifiers are dealt with in terms of explicitly quantified FOL formulas. This semantic account has several problems. It fails to provide a uniform semantics for all the noun phrases that appear in an argument position of a verb in the surface syntax. With this analysis, it is harder to comp...
متن کاملComputational semantics for monadic quantifiers
The paper gives a survey of known results related to computational devices (finite and push–down automata) recognizing monadic generalized quantifiers in finite models. Some of these results are simple reinterpretations of descriptive—feasible correspondence theorems from finite–model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven...
متن کاملFunctorial semantics of topological theories
Following the categorical approach to universal algebra through algebraic theories, proposed by F.~W.~Lawvere in his PhD thesis, this paper aims at introducing a similar setting for general topology. The cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. We introduce t...
متن کاملCOMBINING FUZZY QUANTIFIERS AND NEAT OPERATORS FOR SOFT COMPUTING
This paper will introduce a new method to obtain the order weightsof the Ordered Weighted Averaging (OWA) operator. We will first show therelation between fuzzy quantifiers and neat OWA operators and then offer anew combination of them. Fuzzy quantifiers are applied for soft computingin modeling the optimism degree of the decision maker. In using neat operators,the ordering of the inputs is not...
متن کاملStable Models of Formulas with Generalized Quantifiers
Applications of answer set programming motivated various extensions of the stable model semantics, for instance, to incorporate aggregates and abstract constraint atoms, to facilitate interface with external information sources, such as ontology descriptions, and to integrate with other computing paradigms, such as constraint solving. This paper provides a uniform view on some of these extensio...
متن کامل